The Multi-period Multi-trip Container Drayage Problem with Release and Due Dates

The Container Drayage Problem (CDP) aims at routing a fleet of trucks, based common terminal, to serve customers while minimizing the total travel distance. Each trip starts from and ends handles subset customers. customer requires either that container is picked up or delivered. We introduce more realistic variant, i.e., Multi-trip Multi-period CDP with Release Due Dates (MM-CDP-RDD), in which planning horizon composed several periods (days). On each day, truck may perform than one respecting (RDD) associated services, corresponding first last day on service can be carried out, respectively. Drivers’ contracts impose limitations maximum driving time allowed two consecutive days whole weekly horizon. To model MM-CDP-RDD, we propose both an Arc-based Integer Linear Programming (ILP) formulation Trip-based ILP receives as input all feasible non-dominated trips. efficiently address medium/large-sized instances problem, also design six Combinatorial Benders’ Cuts approaches. All methods are compared rich set generated for this new problem.